Dominating -color Number of Generalized Petersen Graphs
نویسندگان
چکیده
Dominating -color number of a graph is defined as the maximum number of color classes which are dominating sets of and is denoted by d, where the maximum is taken over all -coloring of . In this paper, we discussed the dominating -color number of Generalized Petersen Graphs. We have also discussed the condition under which chromatic number equals dominating -color number of Generalized Petersen Graphs.
منابع مشابه
The lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملTotal Domination number of Generalized Petersen Graphs
Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in this paper.
متن کاملThe exact domination number of the generalized Petersen graphs
Let G = (V, E) be a graph. A subset S ⊆ V is a dominating set of G, if every vertex u ∈ V − S is dominated by some vertex v ∈ S. The domination number, denoted by γ(G), is the minimum cardinality of a dominating set. For the generalized Petersen graph G(n), Behzad et al. [A. Behzad, M. Behzad, C.E. Praeger, On the domination number of the generalized Petersen graphs, Discrete Mathematics 308 (2...
متن کاملDouble Total Domination on Generalized Petersen Graphs
A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G. In this paper, we study the DTDS of the generalized Petersen graphs. Mathematics Subject Classification: 05C35
متن کاملON THE SIGNED TOTAL DOMINATION NUMBER OF GENERALIZED PETERSEN GRAPHS P (n, 2)
Let G = (V, E) be a graph. A function f : V → {−1,+1} defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, γ t (G), is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen...
متن کامل